Improved approximate pattern matching on hypertext
نویسندگان
چکیده
منابع مشابه
Improved Approximate Pattern Matching on Hypertext
The problem of approximate pattern matching on hypertext is defined and solved by Amir et al. in O(m(n log m + e)) time, where m is the length of the pattern, n is the total text size and e is the total number of edges. Their space complexity is O(mn). We present a new algorithm which is O(mk(n + e)) time and needs only O(n) extra space, where k < m is the number of allowed errors in the patter...
متن کاملImproved Approximate Pattern Matching on Hypertext 3
The problem of approximate pattern matching on hypertext is deened and solved by Amir et al. in O(m(n log m + e)) time, where m is the length of the pattern, n is the total text size and e is the total number of edges. Their space complexity is O(mn). We present a new algorithm which is O(mk(n + e)) time and needs only O(n) extra space, where k < m is the number of allowed errors in the pattern...
متن کاملPattern Matching In Hypertext
The importance of hypertext has been steadily growing over the last decade. Internet and other information systems use hypertext format, with data organized associatively rather than sequentially or relationally. A myriad of textual problems have been considered in the pattern matching eld with many non-trivial results. Nevertheless, surprisingly little work has been done on the natural combina...
متن کاملImproved Approximate Pattern
The problem of approximate pattern matching on hypertext is deened and solved by Amir et al. in O(m(n log m + e)) time, where m is the length of the pattern, n is the total text size and e is the total number of edges. Their space complexity is O(mn). We present a new algorithm which is O(m(n+e)) time and needs only O(n) extra space. This improves all previous results in both time and space com...
متن کاملWeighted Degenerated Approximate Pattern Matching
We present a bit-parallel approach to degenerated approximate pattern matching problem. That is the problem of finding approximate matches of a “special” pattern in a text of degenerate symbols. The special pattern P = s1 ∗ (a1,b1) . . . sl ∗ (al,bl) sl+1 ∗ (al+1,bl+1) . . . sω, such that symbol ∗ (a,b) is a sequence of at most b but at least a “don’t care” symbols which match any symbol within...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00333-3